Other enumeration problems lead us to the study of orbits of permutation groups . 其它的計數(shù)問題引導(dǎo)我們?nèi)パ芯恐脫Q群的軌道。
The permutation group coset method in calculations of gauge field vertices 關(guān)于規(guī)范場頂角計算的置換群陪集簡化方法
Regular permutation group 正則置換群
With each recursive step , cross products with one additional permutation group are formed 伴隨每個遞回步驟,會形成帶有一個額外置換群的向量積。
4 . according to the property that all states of a certain cellular automata can build a permutation group , we can design block cipher based on this property 根據(jù)有些細(xì)胞自動機(jī)的所有狀態(tài)可以構(gòu)成一個循環(huán)群這一特點,指出了利用細(xì)胞自動機(jī)構(gòu)造分組密碼的方式。
We start by forming an arraylist containing a set of arraylists , in which each of the constituent arraylists contains exactly one element of the first permutation group 我們開始形成包含一組arraylists的arraylist ,在其中,每個構(gòu)成的arraylists正好包含第一個置換群的一個元素。
The method used here is to recursively form cross products of the values stored in each of the gui - control - possible - value vectors we will call these vectors , " permutation groups " 此處使用的方法是遞回形成儲存在每個gui控制項可能值vectors中的值的積(我們稱這些vectors為“置換群( permutation group ) ” ) 。
Then , a new arraylist is created which contains the cross product of the contents of each of the constituent arraylists of the super - arraylist with all of the elements in the second permutation group 然后,建立一個新的arraylist ,它包含每個(超級arraylist的)構(gòu)成的arraylists的內(nèi)容和第二個置換群的所有單元的向量積。
Subsequently we analyze the isomorphism relationship between ergodic matrices and the corresponding permutation group . by defining the permutation symbol operation system of ergodic matrices , we constructed a union form to express all existed permutation algorithms 通過在理論上分析遍歷矩陣和置換群的同構(gòu)關(guān)系,定義了遍歷矩陣對應(yīng)的置換運算和符號體系,再統(tǒng)一的框架下表達(dá)各種圖像置亂變換。
As to cyclic codes over finite chain rings , we study their stucture and develop the fourier transform method to finite chain rings . the permutation groups of cyclic codes and their extended codes are investigated using their mattson - solomn polynomials 對于有限鏈環(huán)上的循環(huán)碼,我們研究了它們的結(jié)構(gòu),并把傅立葉變換的方法推廣到有限鏈環(huán),用循環(huán)碼的mattson - solomn多項式對循環(huán)碼及其擴(kuò)展碼的置換群進(jìn)行了研究。
百科解釋
In mathematics, a permutation group is a group G whose elements are permutations of a given set M, and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself); the relationship is often written as (G,M). Note that the group of all permutations of a set is the symmetric group; the term permutation group is usually restricted to mean a subgroup of the symmetric group.